//2009/08/20 14:09:24
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <queue>
#include <sstream>
#include <algorithm>

using namespace std;

class BootsExchange
{
public:
    int leastAmount(vector <int> left, vector <int> right)
    {
        int ret = 0;
        sort(left.begin(), left.end());
        sort(right.begin(), right.end());
        for (int i=0; i<left.size(); i++)
        {
            for (int j=0; j<right.size(); j++)
            {
                if (left[i] == right[j])
                {
                    right[j] = -1;
                    break;
                }
            }
        }
        for (int i=0; i<right.size(); i++)
            if (right[i] != -1)
                ret ++;
        return ret;
    }
};
